﻿#region Copyright (c) 2003 - 2008, Andreas Mueller
/////////////////////////////////////////////////////////////////////////////////////////
// 
// Copyright (c) 2003 - 2008, Andreas Mueller.
// All rights reserved. This program and the accompanying materials
// are made available under the terms of the Eclipse Public License v1.0
// which accompanies this distribution, and is available at
// http://www.eclipse.org/legal/epl-v10.html
//
// Contributors:
//    Andreas Mueller - initial API and implementation
//
// 
// This software is derived from software bearing the following
// restrictions:
// 
// Copyright (c) 1994
// Hewlett-Packard Company
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Hewlett-Packard Company makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// Copyright (c) 1996,1997
// Silicon Graphics Computer Systems, Inc.
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Silicon Graphics makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// (C) Copyright Nicolai M. Josuttis 1999.
// Permission to copy, use, modify, sell and distribute this software
// is granted provided this copyright notice appears in all copies.
// This software is provided "as is" without express or implied
// warranty, and with no claim as to its suitability for any purpose.
// 
/////////////////////////////////////////////////////////////////////////////////////////
#endregion


using System;
using NUnit.Framework;
using NStl.Collections;
using System.Collections;
using NUnit.Framework.SyntaxHelpers;
using NStl.Iterators;

namespace NStl.NUnit.AlgorithmFixtures.PartialSort
{
    public abstract class PartialSortCopyBaseFixture
    {
        private static DList<int> src;
        private static Vector<int> target;
        [SetUp]
        public void SetUp()
        {
            src = new DList<int>(7, 2, 6, 9, 3, 0, 8, 4, 1, 5);
        }
        [TearDown]
        public void TearDown()
        {
            src = null;
            target = null;
        }
        protected abstract RndIt DoPartialSortCopy<T, RndIt>(IForwardIterator<T> first, IForwardIterator<T> last,
                                 RndIt resultFirst, RndIt resultLast) where RndIt : IRandomAccessIterator<T> where T: IComparable<T>;
        [Test]
        public void PartialSort()
        {
            target = new Vector<int>(4);

            Vector<int>.Iterator endOfCopy = 
                DoPartialSortCopy(src.Begin(), src.End(), target.Begin(), target.End());

            ICollection expected = new int[] {0, 1, 2, 3};

            Assert.That(target, Is.EqualTo(expected));
            Assert.That(endOfCopy, Is.EqualTo(target.End()));
        }

        [Test]
        public void PartialSortWithLongerTargetRange()
        {
            int targetLength = src.Count + 2;
            target = new Vector<int>(targetLength);

            Vector<int>.Iterator endOfCopy =
                DoPartialSortCopy(src.Begin(), src.End(), target.Begin(), target.End());

            ICollection expected = new int[] {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 0};

            Assert.That(target, Is.EqualTo(expected));
            Assert.That(endOfCopy, Is.EqualTo(target.Begin() + src.Count));
        }
        [Test]
        public void PartialWithEqualLongTargetRange()
        {
            target = new Vector<int>(src.Count);

            Vector<int>.Iterator endOfCopy =
                DoPartialSortCopy(src.Begin(), src.End(), target.Begin(), target.End());

            Assert.That(target, Is.EquivalentTo(src));
            Assert.That(Algorithm.IsSorted(target.Begin(), target.End()), Is.True);
            Assert.That(endOfCopy, Is.EqualTo(target.End()));
        }
        [Test]
        public void PartialSortWithEmptyTargetRange()
        {
            target = new Vector<int>();

            Vector<int>.Iterator endOfCopy =
                DoPartialSortCopy(src.Begin(), src.End(), target.Begin(), target.End());

            Assert.That(target, Is.Empty);
            Assert.That(endOfCopy, Is.EqualTo(target.End()));
        }
        [Test]
        public void PartialSortWithEmptySourceRange()
        {
            src.Clear();
            target = new Vector<int>(2);

            Vector<int>.Iterator endOfCopy =
                DoPartialSortCopy(src.Begin(), src.End(), target.Begin(), target.End());

            ICollection expected = new int[] { 0, 0 };

            Assert.That(target, Is.EqualTo(expected));
            Assert.That(endOfCopy, Is.EqualTo(target.Begin()));
        }
    }
}
